Machine - Assisted Meta - Theory of Sequent - StyleCalculi
نویسنده
چکیده
A formalisation of the implicational fragments of two sequent calculi and a sequent-style presentation of natural deduction in Coq is presented. The systems presented are all typed lambda calculi. Based on this formalisation, some general comments on the feasibility of performing meta-theoretic proofs about typed lambda calculi in a proof assistant based on higher-order type theory are made. Conclusions about the suitability of Coq for this work, as well as some indications as to the future use of completely formal developments in meta-theoretic reasoning, are drawn.
منابع مشابه
Formalized Meta-Theory of Sequent Calculi for Substructural Logics
When studying sequent calculi, proof theorists often have to prove properties about the systems, whether it is to show that they are “well-behaved”, amenable to automated proof search, complete with respect to another system, consistent, among other reasons. These proofs usually involve many very similar cases, which leads to authors rarely writing them in full detail, only pointing to one or t...
متن کاملAxiomatisation of constraint systems to specify a tableaux calculus modulo theories
In this paper we explore a proof-theoretic approach to the combination of generic proof-search and theory-specific procedures, in presence of quantifiers. Forming the basis of tableaux methods, the sequent calculus is refined with meta-variables (a.k.a existential variables or free variables) to delay the choice of witnesses, and parameterised by theory-specific features based on a system of co...
متن کاملMeta - Theory of Sequent - Style Calculi in CoqA
We describe a formalisation of proof theory about sequent-style calculi, based on informal work in DP96]. The formalisation uses de Bruijn nameless dummy variables (also called de Bruijn indices) dB72], and is performed within the proof assistant Coq BB + 96]. We also present a description of some of the other possible approaches to formal meta-theory, particularly an abstract named syntax and ...
متن کاملApplications of Proof Theory to Isabelle
Isabelle [3, 4] is a generic theorem prover. It suppports interactive proof in several formal systems, including first-order logic (intuitionistic and classical), higher-order logic, Martin-Löf type theory, and Zermelo-Fraenkel set theory. New logics can be introduced by specifying their syntax and rules of inference. Both natural deduction and sequent calculi are allowed. Isabelle’s approach i...
متن کاملGödel's Incompleteness Theorems
Gödel’s two incompleteness theorems [2] are formalised, following a careful presentation by Świerczkowski [3], in the theory of hereditarily finite sets. This represents the first ever machine-assisted proof of the second incompleteness theorem. Compared with traditional formalisations using Peano arithmetic [1], coding is simpler, with no need to formalise the notion of multiplication (let alo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007